Optimal Face Identiication Methods and Bounded Variable Linear Programs Optimal Face Identification Methods and Bounded Variable Linear Programs
نویسندگان
چکیده
We extend optimal face identiication methods to bounded variable linear programming problems. Distance to the lower and upper bounds are incorporated into a projection model and Mehrotra{Ye's solution technique to prevent the computed solution from violating the bound constraints. Empirical and theoretical evidence are provided that support use of the new models to compute an exact solution. We also introduce a nonlinear weighted projection method to solve the optimal face identiication problem.
منابع مشابه
Optimal Control of a Variable-Speed Wind Energy Conversion System: A New Approach
The operation of wind energy conversion systems mainly deals with variable and unpredictable wind regimes resulting in variable power efficiency. In addition, nowadays with the presence of high penetration level of wind farms integrated to power systems, stability and power quality problems might be addressed, when a disturbance event occurs. These challenges are worsened with significant degre...
متن کاملA new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP problem
Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...
متن کاملDual Face Algorithm Using Gauss-jordan Elimination for Linear Programming
The dual face algorithm uses Cholesky factorization, as would be not very suitable for sparse computations. The purpose of this paper is to present a dual face algorithm using Gauss-Jordan elimination for solving bounded-variable LP problems.
متن کاملA NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS
There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...
متن کاملA new method for solving fully fuzzy linear Bilevel programming problems
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...
متن کامل